SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri? , Robert Nieuwenhuis?? , and Albert Oliveras?? Abstract. Predicate abstraction is a technique for automatically extracting finite-state abstractions for s

Source URL: www.lsi.upc.edu

• Mathematical logic
• Mathematics
• Theoretical computer science
• Formal methods
• Electronic design automation
• Logic in computer science
• NP-complete problems
• Boolean algebra
• Satisfiability modulo theories
• Boolean satisfiability problem
• 120-cell
• Predicate

SWIFT: Predictive Fast Reroute Technical Report Thomas Holterbach∗† , Stefano Vissicchio‡ , Alberto Dainotti† , Laurent Vanbever∗ ∗ ETH Zürich, † CAIDA, UC San Diego, ‡ University College London ABSTRACT

Source URL: swift.ethz.ch

Challenges for Fast Synthesis Procedures in SMT Andrew Reynolds1 Department of Computer Science, The University of Iowa Abstract A number of synthesis applications are made possible by automated tools for synthesis. Rece

Source URL: www.cs.man.ac.uk

• Mathematical logic
• Theoretical computer science
• Mathematics
• Quantification
• Logic in computer science
• Formal methods
• Electronic design automation
• NP-complete problems
• Satisfiability modulo theories
• Boolean satisfiability problem
• Universal quantification
• True quantified Boolean formula

Fast Evolutionary Adaptation for Monte Carlo Tree Search Simon M. Lucas, Spyridon Samothrakis and Diego Perez University of Essex, UK Abstract This paper describes a new adaptive Monte Carlo Tree Search (MCTS) algorithm

Source URL: www.diego-perez.net

Analysis of Fast Adaptive Traffic Engineering Using a Feedback Control Model Ning Wu and Ao Tang Abstract— This paper analyzes fast adaptive traffic engineering from a feedback control perspective. We provide a model t

Source URL: people.ece.cornell.edu

Modular SMT Proofs for Fast Reflexive Checking inside Coq? Fr´ed´eric Besson, Pierre-Emmanuel Cornilleau, and David Pichardie INRIA Rennes – Bretagne Atlantique, France Abstract. We present a new methodology for exc

Source URL: people.rennes.inria.fr

Fast, Ad Hoc Query Evaluations over Multidimensional Geospatial Datasets Matthew Malensek, Sangmi Pallickara, and Shrideep Pallickara, Members, IEEE Abstract—Networked observational devices and remote sensing equipment

Source URL: glean.cs.colostate.edu

A Lagrangian-DNN Relaxation: a Fast Method for Computing Tight Lower Bounds for a Class of Quadratic Optimization Problems Sunyoung Kim? , Masakazu Kojima† and Kim-Chuan Toh‡ October 2013 Abstract. We propose an effi

Source URL: www.math.nus.edu.sg

Fast Trajectory Optimization for Agile Quadrotor Maneuvers with a Cable-Suspended Payload Philipp Foehn1 , Davide Falanga1 , Naveen Kuppuswamy2 , Russ Tedrake2 , Davide Scaramuzza1 Abstract—Executing agile quadrotor ma

Source URL: rpg.ifi.uzh.ch

• Physics
• Mechanics
• Ballistics
• Dynamical systems
• Aerodynamics
• Mathematical optimization
• Trajectory optimization
• Quadcopter
• Trajectory
• Constraint
• Work
• Lagrangian mechanics

Fast Reflexive Arithmetic Tactics the linear case and beyond Fr´ed´eric Besson? Irisa/Inria, Campus de Beaulieu, 35042 Rennes Cedex, France Abstract. When goals fall in decidable logic fragments, users of proofassista

Source URL: people.rennes.inria.fr